Complete solutions to a family of cubic Diophantine equations
نویسندگان
چکیده
منابع مشابه
The Number of Solutions of Diophantine Equations
0. Introduction. In two recent papers 4], 30], Erdd os, Stewart and the author showed that certain diophantine equations have many solutions. In this way they indicated how far certain results are capable for improvements at most. First we mention some relevant results from the literature on upper bounds for the numbers of solutions of diophantine equations and then we sketch how our method lea...
متن کاملSmall solutions of linear Diophantine equations
Let Ax = B be a system of m x n linear equations with integer coefficients. Assume the rows of A are linearly independent and denote by X (respectively Y) the maximum of the absolute values of the m x m minors of the matrix A (the augmented matrix (A, B)). If the system has a solution in nonnegative integers, it is proved that the system has a solution X = (xi) in nonnegative integers with xi <...
متن کاملSparse Solutions of Linear Diophantine Equations
We present structural results on solutions to the Diophantine system Ay = b, y ∈ Z ≥0 with the smallest number of non-zero entries. Our tools are algebraic and number theoretic in nature and include Siegel’s Lemma, generating functions, and commutative algebra. These results have some interesting consequences in discrete optimization.
متن کاملOn the Solutions of Quadratic Diophantine Equations
We determine a finite set of representatives of the set of local solutions in a maximal lattice modulo the stabilizer of the lattice in question for a quadratic Diophantine equation. Our study is based on the works of Shimura on quadratic forms, especially [AQC] and [IQD]. Indeed, as an application of the result, we present a criterion (in both global and local cases) of the maximality of the l...
متن کاملPositive Solutions to Some Systems of Diophantine Equations
We consider a sequence defined by the number of positive solutions to a sequence of systems of Diophantine equations. We derive some bounds on the solutions to demonstrate that the terms of the sequence are finite. We develop an algorithm for 1 computing an arbitrary term of the sequence, and consider a graph-theoretic approach to computing the same.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1990
ISSN: 0022-314X
DOI: 10.1016/0022-314x(90)90154-j